منابع مشابه
Solving Quadratic Assignment Problems
We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...
متن کاملSolving Large Quadratic Assignment Problems
Quadratic Assignment problems are in practice among the most diicult to solve in the class of NP-complete problems. The only successful approach hitherto has been Branch-and-Bound-based algorithms, but such algorithms are crucially dependent on good bound functions to limit the size of the space searched. Much work has been done to identify such functions for the QAP, but with limited success. ...
متن کاملA survey for the quadratic assignment problem
The quadratic assignment problem (QAP) is very challengeable and interesting problem that can model many real-life problems. In this paper, we will simply discuss the meaning of quadratic assignment problem, solving techniques and we will give a survey of some developments and researches.
متن کاملExact solution of emerging quadratic assignment problems
We report on a growing class of assignment problems that are increasingly of interest and very challenging in terms of the difficulty they pose to attempts at exact solution. These problems address economic issues in the location and design of factories, hospitals, depots, transportation hubs and military bases. Others involve improvements in communication network design. In this article we sur...
متن کاملNew Convex Relaxations for Quadratic Assignment Problems
Quadratic assignment problems (QAPs) are known to be among the hardest discrete optimization problems. Recent study shows that even obtaining a strong lower bound for QAPs is a computational challenge. In this paper, we first discuss how to construct new simple convex relaxations of QAPs based on various matrix splitting schemes. Then we introduce the so-called symmetric mappings that can be us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/17693-8662